Estimating the Largest Singular Values/Vectors of Large Sparse Matrices via Modified Moments
نویسنده
چکیده
This dissertation considers algorithms for determining a few of the largest singular values and corresponding vectors of large sparse matrices by solving equivalent eigenvalue problems. The procedure is based on a method by Golub and Kent for estimating eigenvalues of equvalent eigensystems using modified moments. The asynchronicity in the computations of moments and eigenvalues makes this method attractive for parallel implementations on a network of workstations. However, one potential drawback to this method is that there is no obvious relationship between the modified moments and the eigenvectors. The lack of eigenvector approximations makes deflation schemes difficult, and no robust implementation of the Golub/Kent scheme are currently used in practical applications. Methods to approximate both eigenvalues and eigenvectors using the theory of modified moments in conjunction with the Chebyshev semi-iterative method are described in this disseratation. Deflation issues and implicit error approximation methods are addressed to present a complete algorithm. The performance of an ANSI-C implementation of this scheme on a network of UNIX workstations using PVM is presented. The portability of this implementation is demonstrated through results on a 256 processor Cray T3D massively-parallel computer.
منابع مشابه
Approximating Dominant Singular Triplets of LargeSparse Matrices via Modi ed Moments
A procedure for determining determining a few of the largest singular values and corresponding singular vectors of large sparse matrices is presented. Equivalent eigensystems are solved using a technique originally proposed by Golub and Kent based on the computation of modiied moments. The asynchronicity in the computations of moments and eigenvalues makes this method attractive for parallel im...
متن کاملLarge Scale Sparse Singular Value Computations
In this paper, we present four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture. We particularly emphasize Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left-and right-singular vectors) for sparse matrices arising from two pra...
متن کاملAn Implicitly Restarted Lanczos Bidiagonalization Method for Computing Smallest Singular Triplets
We describe the development of a method for the efficient computation of the smallest singular values and corresponding vectors for large sparse matrices [4]. The method combines state-of-the-art techniques that make it a useful computational tool appropriate for large scale computations. The method relies upon Lanczos bidiagonalization (LBD) with partial reorthogonalization [6], enhanced with ...
متن کاملEstimating a Few Extreme Singular Values and Vectors for Large-Scale Matrices in Tensor Train Format
We propose new algorithms for singular value decomposition (SVD) of very large-scale matrices based on a low-rank tensor approximation technique called the tensor train (TT) format. The proposed algorithms can compute several dominant singular values and corresponding singular vectors for large-scale structured matrices given in a TT format. The computational complexity of the proposed methods ...
متن کاملSolving Large Linear Inverse Problems in Geophysics by means of Eigenvalue Calculations
This paper discusses the computation and utilization of singular values and singular vectors in the solution of very large inverse problems that arise in the study of physical models for the internal structure of the Earth. In this study, the Earth is discretized into layers and the layers into cells, and travel times of sound waves generated by earthquakes are used to construct the models. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995